? Bipartite Scaphoids
نویسندگان
چکیده
منابع مشابه
Chordal Bipartite Bipartite
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphismproblem), which can be solved in polynomialtime for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of classes forming an innnite lattice with respe...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملEnumeration of Bipartite Graphs and Bipartite Blocks
We use the theory of combinatorial species to count unlabeled bipartite graphs and bipartite blocks (nonseparable or 2-connected graphs). We start with bicolored graphs, which are bipartite graphs that are properly colored in two colors. The two-element group S2 acts on these graphs by switching the colors, and connected bipartite graphs are orbits of connected bicolored graphs under this actio...
متن کاملConstructions of Bipartite and Bipartite-regular Hypermaps
A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is bipartiteregular if its set of automorphisms is transitive on A and on B. In this paper we see some properties of the constructions of bipartite hypermaps desc...
متن کاملBipartite Subgraphs
It is shown that there exists a positive c so that for any large integer m, any graph with 2m 2 edges contains a bipartite subgraph with at least m 2 + m/2 + c √ m edges. This is tight up to the constant c and settles a problem of Erd˝ os. It is also proved that any triangle-free graph with e > 1 edges contains a bipartite subgraph with at least e 2 + c e 4/5 edges for some absolute positive co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society of Medicine
سال: 1930
ISSN: 0035-9157
DOI: 10.1177/003591573002400109